Incremental Connector Routing
نویسندگان
چکیده
Most diagram editors and graph construction tools provide some form of automatic connector routing, typically providing orthogonal or poly-line connectors. Usually the editor provides an initial automatic route when the connector is created and then modifies this when the connector end-points are moved. None that we know of ensure that the route is of minimal length while avoiding other objects in the diagram. We study the problem of incrementally computing minimal length object-avoiding poly-line connector routings. Our algorithms are surprisingly fast and allow us to recalculate optimal connector routings fast enough to reroute connectors even during direct manipulation of an object’s position, thus giving instant feedback to the diagram author.
منابع مشابه
Generalized Connectbrs
This paper presents a new generalized connector with a very simple self-routing scheme. Unlike some of the recently reported generalized connectors, this generalized connector does not rely on an explicit use of a copy network; rather it replicates packets as it routes them through its stages to their destinations. In addition to its attractive routing scheme, this generalized connector can be ...
متن کاملOrthogonal Connector Routing
Orthogonal connectors are used in a variety of common network diagrams. Most interactive diagram editors provide orthogonal connectors with some form of automatic connector routing. However, these tools use ad-hoc heuristics that can lead to strange routes and even routes that pass through other objects. We present an algorithm for computing optimal object-avoiding orthogonal connector routings...
متن کاملHierarchical Routing Protocol for Free-Space Optical Mobile Ad hoc Networks (FSO/RF MANET)
The existing routing protocols in mobile ad hoc network such as DSDV, AODV, DSR, ZRP, SRL, HSR, etc cannot be utilized for FSO/RF MANET owing to certain disjoint characteristics of free space optical (FSO) and MANET. The characteristics include accommodating directionality, accuracy in routing information, memory, reduced overhead and delay. In this paper, a hierarchical routing protocol for FS...
متن کاملDesign of Efficient and Easily Routable Generalized Connectors
This paper presents a new generalized connector with a very simple self-routing scheme. Unlike some of the recently reported generalized connectors, this generalized connector does not rely on an explicit use of a copy network; rather it replicates packets as it routes them through its stages to their destinations. In addition to its attractive routing scheme, this generalized connector can be ...
متن کاملSeeing Around Corners: Fast Orthogonal Connector Routing
Orthogonal connectors are used in drawings of many types of network diagrams, especially those representing electrical circuits. One approach for routing such connectors has been to compute an orthogonal visibility graph formed by intersecting vertical and horizontal lines projected from the corners of all obstacles and then use an A* search over this graph. However the search can be slow since...
متن کامل